Revealing evolutions in dynamical networks

نویسندگان

  • Matteo Morini
  • Patrick Flandrin
  • Eric Fleury
  • Tommaso Venturini
  • Pablo Jensen
چکیده

The description of large temporal graphs requires effective methods giving an appropriate mesoscopic partition. Many approaches exist today to detect “communities”, ie groups of nodes that are densely connected (Fortunato, 2010), in static graphs. However, many networks are intrinsically dynamical, and need a dynamic mesoscale description, as interpreting them as static networks would cause loss of important information (Holme and Saramaki, 2012; Holme 2015). For example, dynamic processes such as the emergence of new scientific disciplines, their fusion, split or death need a mesoscopic description of the evolving network of scientific articles. There are two straightforward approaches to describe an evolving network using methods developed for static networks. The first finds the community structure of the ​aggregated network, ie the network found by aggregating the nodes and their links at all times. However, this approach discards most temporal information, and may lead to inappropriate descriptions, as very different dynamic data can give rise to the identical static graphs (Berger-Wolf and Saia, 2006). To avoid this problem, the opposite approach closely follows the evolutions and builds networks for successive time slices by selecting the relevant nodes and edges. Then, the mesoscopic structure of each of these slices is found ​independently and the structures are connected in various ways to obtain a temporal description (Berger-Wolf and Saia, 2006; G. Palla et al, 2007, Rosvall and Bergstrom, 2010, Chavalarias and Cointet, 2013). By using an optimal structural description at each time slice, this method avoids the inertia of the aggregated approach. Its main drawback lies in the inherent fuzziness of the communities, which leads to “noise” and artificial mesoscopic evolutions, with no counterpart in the real evolutions of the data. For example, rather different partitions have a very close modularity (Good et al, 2010), and minor changes in the network may lead to quite different partitions in successive time slices, which would be inadequately interpreted as major structural changes. Several methods have been proposed to overcome the problems of these two extreme approaches (Gauvin et al. 2015, Peel and Clauset, 2014, Mucha et al, 2010, Kawadia and Sreenivasan 2012). Here, we present a new approach that distinguishes real trends and noise in the mesoscopic description of social data using the continuity of social evolutions. To be able to

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synchronization analysis of complex dynamical networks with hybrid coupling with application to Chua’s circuit

Complex dynamic networks have been considered by researchers for their applications in modeling and analyzing many engineering issues. These networks are composed of interconnected nodes and exhibit complex behaviors that are resulted from interactions between these nodes. Synchronization, which is the concept of coordinated behavior between nodes, is the most interested behavior in these netwo...

متن کامل

Synchronization criteria for T-S fuzzy singular complex dynamical networks with Markovian jumping parameters and mixed time-varying delays using pinning control

In this paper, we are discuss about the issue of synchronization for singular complex dynamical networks with Markovian jumping parameters and additive time-varying delays through pinning control by Takagi-Sugeno (T-S) fuzzy theory.The complex dynamical systems consist of m nodes and the systems switch from one mode to another, a Markovian chain with glorious transition probabili...

متن کامل

Random Evolutions toward Applica- Tions

This article gives a short and elementary presentation of random evolutions toward applications in reliability and quality engineering. At first, the following two examples are presented: dynamical stochastic systems and increment processes both in Markov media. A dynamical system in continuous time is presented since nowadays they are widely used in dynamic reliability modeling. Limit theorems...

متن کامل

PROJECTED DYNAMICAL SYSTEMS AND OPTIMIZATION PROBLEMS

We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...

متن کامل

New dynamical scaling universality for quantum networks across adiabatic quantum phase transitions.

We reveal universal dynamical scaling behavior across adiabatic quantum phase transitions in networks ranging from traditional spatial systems (Ising model) to fully connected ones (Dicke and Lipkin-Meshkov-Glick models). Our findings, which lie beyond traditional critical exponent analysis and adiabatic perturbation approximations, are applicable even where excitations have not yet stabilized ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1707.02114  شماره 

صفحات  -

تاریخ انتشار 2017